Approximation algorithms and decision making in the Dempster-Shafer theory of evidence — An empirical study

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximation algorithms and decision making in the Dempster-Shafer theory of evidence - An empirical study

The computational complexity of reasoning within the Dempster-Shafer theory of evidence is one of the major points of criticism this formalism has to face. To overcome this diiculty various approximation algorithms have been suggested that aim at reducing the number of focal elements in the belief functions involved. This article reviews a number of algorithms based on this method and introduce...

متن کامل

Linguistic Decision Making Using Dempster-shafer Theory of Evidence

We study different approaches for decision making with linguistic information. We describe some basic linguistic aggregation operators. We then analyze the problem of linguistic decision making with Dempster-Shafer (D-S) belief structure. We suggest the use of different types of linguistic aggregation operators in the D-S framework such as the linguistic ordered weighted averaging (LOWA) operat...

متن کامل

Uncertain Decision Making with Dempster-Shafer Theory

We develop a new approach for decision making with Dempster-Shafer theory of evidence by using uncertain information represented in the form of interval numbers. We suggest the use of different types of uncertain aggregation operators in the problem. Then, we obtain new aggregation operators such as the belief structure uncertain ordered weighted averaging (BSUOWA) operator and the BS uncertain...

متن کامل

Approximations for Decision Making in the Dempster-Shafer Theory of Evidence

The computational complexity of reasoning within the Dempster-Shafer theory of evidence is one of the main points of criticism this formalism has to face. To overcome this difficulty various approximation algorithms have been suggested that aim at reducing the number of focal elements in the belief functions involved. Besides introducing a new algorithm using this method, this paper describes a...

متن کامل

Algorithms for Dempster-Shafer Theory

The method of reasoning with uncertain information known as Dempster-Shafer theory arose from the reinterpretation and development of work of Arthur Dempster [Dempster, 67; 68] by Glenn Shafer in his book a mathematical theory of evidence [Shafer, 76], and further publications e.g., [Shafer, 81; 90]. More recent variants of Dempster-Shafer theory include the Transferable Belief Model see e.g., ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Approximate Reasoning

سال: 1997

ISSN: 0888-613X

DOI: 10.1016/s0888-613x(97)00013-3